A Constraint Satisfaction Approach to Geospatial Reasoning
نویسندگان
چکیده
The large number of data sources on the Internet can be used to augment and verify the accuracy of geospatial sources, such as gazetteers and annotated satellite imagery. Data sources such as satellite imagery, maps, gazetteers and vector data have been traditionally used in geographic information systems (GIS), but nontraditional geospatial data, such as online phone books and property records are more difficult to relate to imagery. In this paper, we present a novel approach to combining extracted information from imagery, road vector data, and online data sources. We represent the problem of identifying buildings in satellite images as a constraint satisfaction problem (CSP) and use constraint programming to solve it. We apply this technique to real-world data sources in El Segundo, CA and our experimental evaluation shows how this approach can accurately identify buildings when provided with both traditional and nontraditional data sources.
منابع مشابه
Constraint Programming for Modelling and Solving Modal Satisfiability
We explore to what extent and how efficiently constraint programming can be used in the context of automated reasoning for modal logics. We encode modal satisfiability problems as constraint satisfaction problems with non-boolean domains, together with suitable constraints. Experiments show that the approach is very promising.
متن کاملIntegrating Constraint Satisfaction and Spatial Reasoning
Many problems in AI, including planning, logical reasoning and probabilistic inference, have been shown to reduce to (weighted) constraint satisfaction. While there are a number of approaches for solving such problems, the recent gains in efficiency of the satisfiability approach have made SAT solvers a popular choice. Modern propositional SAT solvers are efficient for a wide variety of problem...
متن کاملRelation Variables in Qualitative Spatial Reasoning
We study an alternative to the prevailing approach to modelling qualitative spatial reasoning (QSR) problems as constraint satisfaction problems. In the standard approach, a relation between objects is a constraint whereas in the alternative approach it is a variable. By being declarative, the relation-variable approach greatly simplifies integration and implementation of QSR. To substantiate t...
متن کاملSpatio - Temporal Reasoning Using Amulti - Dimensional Tesseralrepresentationf
A versatile and universally applicable quantitative multi-dimensional reasoning mechanism founded on a unique linear tesseral representation of space is described. The reasoning mechanism is based on a constraint satisfaction mechanism supported by a heuristically guided constraint satisfaction approach The mechanism has been incorporated into a spatio-temporal reasoning system, the SPARTA (SPA...
متن کاملOn Non-Binary Temporal Relations
I present a new approach towards temporal reasoning that generalizes from the temporal relations commonly used in Allen's qualitative interval calculus and in quantitative temporal constraint satisfaction problems and includes interval relations with distances, temporal rules and other non-binary relations into the reasoning scheme. Moreover, I investigate how several factors underlying my gene...
متن کامل